Stability conditions for some distributed systems: buffered random access systems
نویسندگان
چکیده
منابع مشابه
Stability Conditions for Some Distributed Systems: Buffered Random Access Systems
We consider the standard slotted ALOHA system with a nite number of buuered users. Stability analysis of such a system was initiated in 1979 by Tsybakov and Mikhailov. Since then several bounds on the stability region have been established, however, the exact stability region is known only for the symmetric system and two users ALOHA. This paper proves necessary and suucient conditions for stab...
متن کاملStabilty Conditions for Some Multiqueue Distributed Systems: Buffered Random Access Systems
Assessing stability of multidimensional systems is notoriously difficult. We consider the standard discrete-time slotted ALOHA system with a finite number of buffered users. Stability study of such a system was initiated in 1979 by Tsybakov and Mikhailov. Several bounds on the stability region have been established up-to-date, however, the exact stability region is known only for the symmetric ...
متن کاملTowards Stability Criteria For Multidimensional Distributed Systems: Buffered Aloha Case
A distributed system can be viewed as a multidimensional, not necessarily Markovian, stochastic process over a large (typically infinite) state space. Assessing stability of such multidimensional systems is notoriously difficult. In this paper we consider the standard discrete-time slotted ALOHA system with a finite number of buffered users. The stability region for t1us system is known only fo...
متن کاملchannel estimation for mimo-ofdm systems
تخمین دقیق مشخصات کانال در سیستم های مخابراتی یک امر مهم محسوب می گردد. این امر به ویژه در کانال های بیسیم با خاصیت فرکانس گزینی و زمان گزینی شدید، چالش بزرگی است. مقالات متعدد پر از روش های مبتکرانه ای برای طراحی و آنالیز الگوریتم های تخمین کانال است که بیشتر آنها از روش های خاصی استفاده می کنند که یا دارای عملکرد خوب با پیچیدگی محاسباتی بالا هستند و یا با عملکرد نه چندان خوب پیچیدگی پایینی...
Hybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 1994
ISSN: 0001-8678,1475-6064
DOI: 10.2307/1427448